Extension and Implementation of Homogeneous Self-dual Methods for Symmetric Cones under Uncertainty
نویسندگان
چکیده
Homogeneous self-dual algorithms for stochastic semidefinite programs with finite event space has been proposed by Jin et al. in [12]. Alzalg [8], has adopted their work to derive homogeneous self-dual algorithms for stochastic second-order programs with finite event space. In this paper, we generalize these two results to derive homogeneous self-dual algorithms for stochastic programs with finite event space over the much wider class of all symmetric cones. They include among others, stochastic semidefinite programs and stochastic second order cone programs. Special structure of the problem has been exploited to significantly reduce the computational burden. Numerical results on a simple test-case problem are finally presented for the homogeneous self-dual algorithm.
منابع مشابه
Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones
SeDuMi is an add-on for MATLAB, that lets you solve optimization problems with linear, quadratic and semideeniteness constraints. It is possible to have complex valued data and variables in SeDuMi. Moreover, large scale optimization problems are solved eeciently, by exploiting sparsity. This paper describes how to work with this toolbox. SeDuMi stands for Self-Dual-Minimization: it implements t...
متن کاملConic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
We introduce a first-order method for solving very large convex cone programs. Themethod uses an operator splittingmethod, the alternating directionsmethod of multipliers, to solve the homogeneous self-dual embedding, an equivalent feasibility problem involving finding a nonzero point in the intersection of a subspace and a cone. This approach has several favorable properties. Compared to inter...
متن کاملExtension of primal-dual interior point methods to diff-convex problems on symmetric cones
We consider the extension of primal dual interior point methods for linear programming on symmetric cones, to a wider class of problems that includes approximate necessary optimality conditions for functions expressible as the difference of two convex functions of a special form. Our analysis applies the Jordan-algebraic approach to symmetric cones. As the basic method is local, we apply the id...
متن کاملSecond-Order Symmetric Duality for Minimax Mixed Integer Programs over Cones
A duality theorem for a pair of Wolfe-type second-order minimax mixed integer symmetric dual programs over cones is proved under separability and η-bonvexity/η-boncavity of the function k(x, y) appearing in the objective, where : . n m k R R R × ֏ Mond-Weir type symmetric duality over cones is also studied under η-pseudobonvexity/ηpseudoboncavity assumptions. Self duality (when the dual proble...
متن کاملSemidefinite programming — an introduction
Interior point methods can be extended to a number of cones (self-dual homogeneous cones) • Rn (linear programming) • vectorized symmetric matrices over real numbers (semidefinite programming) • vectorized Hermitian matrices over complex numbers • vectorized Hermitian matrices over quaternions • vectorized Hermitian 3×3 matrices over octonions Grötschel, Lovász and Schrijver [3]: semidefinite p...
متن کامل